Algorithm Visualizer - Merge Sort
A lightweight, no-build-tools algorithm visualizer that showcases engineering skills without complexity.
20
Step
0 / 0
Comparisons
0
Swaps
0
Algorithm Information
Name: Merge Sort
Description: A divide-and-conquer algorithm that recursively splits the array, sorts the subarrays, and merges them back together.
Time Complexity: O(n log n) in all cases
Space Complexity: O(n)
Stable: Yes
In-Place: No
How to Use
- Space: Play/Pause
- ←/→: Step backward/forward
- R: Reset
- Speed slider: Adjust animation speed
Watch how the algorithm divides the array, sorts subarrays, and merges them back together!